An Insertion Heuristic for the Capacitated Vehicle Routing Problem with Loading Constraints and Mixed Linehauls and Backhauls

In this paper, a capacitated vehicle routing problem with mixed linehauls and backhauls is presented. The addressed problem belongs to the subclass of pickup and delivery problems. Loading and sequencing constraints are also considered. These constraints arise in many realworld situations, and can improve efficiency since backhaul customers do not need to be delayed in a route when it is possible to load their items without rearrengements. The suggested approach is based on an insertion heuristic presented in the literature but extended to tackle the explicit consideration of loading constraints. Different strategies are presented and tested. An exhaustive computational study is performed on instances adapted from benchmark instances for integrated routing and loading problems.